Towards an Intersection and Union Logic
نویسندگان
چکیده
A logical foundation for the intersection and union types assignment system (IUT) is proposed. We present Intersection-Union Logic (IUL) as an extension of Intersection Logic (IL) by adding rules for union and we examine some properties of this system and its relation with intuitionistic minimal logic.
منابع مشابه
Towards a Logic for Union Types
We examine a logical foundation for the intersection and union types assignment system (IUT). The proposed system is Intersection and Union Logic (IUL), an extension of Intersection Logic (IL) with the canonical rules for union. We investigate two different formalisms for IUL, as well as its properties and its relation with minimal intuitionistic logic.
متن کاملA Dual Tableau-based Decision Procedure for a Relational Logic with the Universal Relation
We present a first result towards the use of entailment inside relational dual tableau-based decision procedures. To this end, we introduce a fragment of RL(1), called ({1,[,\} ; ), which admits a restricted form of composition. We prove the decidability of the ({1,[,\} ; )fragment by defining a dual tableau-based decision procedure with a suitable blocking mechanism and where the decomposition...
متن کاملON THE SYSTEM OF LEVEL-ELEMENTS INDUCED BY AN L-SUBSET
This paper focuses on the relationship between an $L$-subset and the system of level-elements induced by it, where the underlying lattice $L$ is a complete residuated lattice and the domain set of $L$-subset is an $L$-partially ordered set $(X,P)$. Firstly, we obtain the sufficient and necessary condition that an $L$-subset is represented by its system of level-elements. Then, a new representat...
متن کاملA Dual Tableau-based Decision Procedure for a Relational Logic with the Universal Relation (Extended Version)
We present a first result towards the use of entailment inside relational dual tableau-based decision procedures. To this end, we introduce a fragment of RL(1), called ({1,∪,∩} ; ), which admits a restricted form of composition, (R ;S) or (R ; 1), where the left subterm R of (R ; S) is only allowed to be either the constant 1, or a Boolean term neither containing the complement operator nor the...
متن کاملA Translation of Intersection and Union Types for the λμ-Calculus
We introduce an intersection and union type system for the λμ-calculus, which includes a restricted version of the traditional unionelimination rule. We give a translation from intersection and union types into intersection and product types, which is a variant of negative translation from classical logic to intuitionistic logic and naturally reflects the structure of strict intersection and un...
متن کامل